Linear Broadcasting and N loglog N Election in Unoriented Hypercubes
نویسندگان
چکیده
In this paper, we provide eecient broadcasting and election algorithms in unoriented hypercubes. First, O(N) broadcasting and traversing algorithms are introduced, where N is the number of hy-percube vertices. This answers aarmatively the open question stated in Tel95a] whether linear-message broadcasting and traversing can be achieved on hypercubes without sense of direction. Moreover, by exploiting new techniques we designed an O(N log log N) leader election algorithm. This is the rst known solution being able to exploit graph-theoretic properties of unoriented hypercubes such that it outperforms algorithms designed for general graphs GHS83].
منابع مشابه
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes
We consider broadcasting on asynchronous anonymous totally unoriented N node hypercubes. First we generalize a technique, introduced in [3], for partial broadcasting and orientation. Using this technique we develop a broadcasting algorithm on unoriented hypercubes that uses only linear number of bits and runs in optimal time. This gives a positive answer to the question raised in [7] whether O(...
متن کاملLinear Election for Oriented Hypercubes
In this article we propose an election algorithm for the oriented hypercube, where each edge is assumed to be labeled with its dimension in the hypercube. The algorithm exchanges O(N) messages and uses O(log 2 N) time (where N is the size of the cube). A randomized version of the algorithm achieves the same (expected) message and time bounds, but uses messages of only O(log log N) bits and can ...
متن کاملOptimal Elections in Labeled Hypercubes
We study the message complexity of the Election Problem in Hypercube networks , when the processors have a \Sense of Direction", i.e., the capability to distinguish between adjacent communication links according to some globally consistent scheme. We present two models of Sense of Direction, which diier regarding the way the labeling of the links in the network is done: either by matching based...
متن کاملBroadcasting on Anonymous Unoriented Tori
We consider broadcasting on asynchronous anonymous totally unoriented n×m torus, where N = n·m is the number of nodes. We present a broadcasting algorithm with message complexity 1.43N+O(n+ m) and prove the lower bound in the form 1.14N−O(1). This is an improvement over the previous 2N+O( √ N) upper bound and 1.04N −O(√N) lower bound achieved by Diks, Kranakis and Pelc [DKP96]. Unlike the algor...
متن کاملSublinear Bounds for Randomized Leader Election
This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O( √ n log n) messages to elect a unique leader (with high probability). When considering the “explicit” variant of leader election where eventually every node knows th...
متن کامل